Artificial Creation Of Dominant Sequences That Are Representative Of Logged Events

ABSTRACT

Dominant sequences that are representative of logged events can be artificially created. Initially, a graph comprising multiple nodes and edges between pairs of nodes is generated from logged information. The weights, or values, associated with edges are incremented as the log data reveals a temporal relationship between two nodes. Subsequently, a set of candidate trajectories, with each candidate trajectory representing a sequence of events, are generated by repeatedly traversing the generated graph in a random manner by commencing at randomly selected nodes and then proceeding in a random manner to subsequent nodes in accordance with the edge values, for a random quantity of steps. The candidate trajectories are filtered to eliminate those that are impossible or improbable based on a comparison between individual candidate trajectories and the quantity of occurrences within the logs. Scoring is based both on a quantity of occurrences as well as a quantity of steps.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims the benefit of and priority to U.S. patentapplication Ser. No. 15/636,137 filed on Jun. 28, 2017 and entitled“Artificial Creation Of Dominant Sequences That Are Representative OfLogged Events”, which application is expressly incorporated herein byreference in its entirety.

BACKGROUND

Increasingly, multitudes of individual users rely on networked computingdevices to provide functionality and to enable those users to performtasks with such provided functionality. Because of the ubiquity ofnetwork communications, computing functionality provided over a networkcan be accessed by millions of different users on a daily basis. Whilethe interactions of such users with the networked computing devices canbe logged, the sheer volume of such logged information can render suchlogged information very difficult to parse and even more difficult tomine for information that can be utilized to improve the operation ofsuch networked computing devices, improve the functionality provided, orcombinations thereof. More specifically, patterns or sequences of eventscan be hidden within such voluminous logged information, where suchpatterns or sequences of events, if known, could identify failurevectors that should be corrected, user behavioral patterns that can bemore efficiently utilized for greater productivity or throughput, andother like operational or functional improvements.

SUMMARY

Dominant sequences that are representative of logged events can beartificially created, thereby providing usable feedback from otherwiseunwieldy logs. Initially, logged information can be partitioned based ona selected logged attribute. Subsequently, a graph comprising multiplenodes and edges between pairs of nodes can be generated from suchpartitioned logged information, with each node in the graph representinga unique attribute-value pair from the logged information. As the loggeddata is traversed for purposes of generating such a graph, the weights,or values, associated with edges can be incremented as the log datareveals a conceptually adjacent relationship between two logged eventsrepresented by two nodes connected by the incremented edge.Subsequently, a set of candidate trajectories, with each candidatetrajectory representing a sequence of events, can be generated byrepeatedly traversing the generated graph in a random manner. Morespecifically, such traversals can commence at randomly selected nodesand can then proceed in a random manner to subsequent nodes inaccordance with the edge values previously determined. Such traversalscan proceed for a random quantity of steps through the graph. Thecandidate trajectories can then be filtered to eliminate candidatetrajectories that are impossible or improbable. Such filtering can bebased on a comparison between an individual candidate trajectory and thequantity of occurrences of that candidate trajectory within the logs. Ofthe remaining candidate trajectories, they can be scored based both on aquantity of occurrences of each such candidate trajectory within thelogs, as well as based upon a quantity of steps in each candidatetrajectory. Highly scored candidate trajectories, therefore, canrepresent sequences of events that both occur with sufficient regularitywithin the logged data, and are of an increased length, therebyproviding actionable feedback. As an optimization, prior to thegeneration of a graph from the logs, the logs can be filtered to removeattributes whose values lack repetition or are otherwise too uniquely orevenly spread out to facilitate efficient analysis.

This Summary is provided to introduce a selection of concepts in asimplified form that are further described below in the DetailedDescription. This Summary is not intended to identify key features oressential features of the claimed subject matter, nor is it intended tobe used to limit the scope of the claimed subject matter.

Additional features and advantages will be made apparent from thefollowing detailed description that proceeds with reference to theaccompanying drawings.

DESCRIPTION OF THE DRAWINGS

The following detailed description may be best understood when taken inconjunction with the accompanying drawings, of which:

FIG. 1 is a system diagram of an exemplary system for utilizingartificially created dominant sequences that are representative oflogged events;

FIG. 2 is a block diagram of an exemplary system for artificiallycreating dominant sequences that are representative of logged events;

FIG. 3 is a block diagram of an exemplary logged data and correspondinggenerated graph;

FIG. 4 is a flow diagram of an exemplary series of steps by whichdominant sequences that are representative of logged events can beartificially created; and

FIG. 5 is a block diagram of an exemplary computing device.

DETAILED DESCRIPTION

The following description relates to the artificial creation of dominantsequences that are representative of logged events, thereby providingusable feedback from otherwise unwieldy logs. Initially, loggedinformation can be partitioned based on a selected logged attribute.Subsequently, a graph comprising multiple nodes and edges between pairsof nodes can be generated from logged information, with each node in thegraph representing a unique attribute-value pair from the loggedinformation. As the logged data is traversed for purposes of generatingsuch a graph, the weights, or values, associated with edges can beincremented as the log data reveals a conceptually adjacent relationshipbetween two logged events represented by two nodes connected by theincremented edge. Subsequently, a set of candidate trajectories, witheach candidate trajectory representing a sequence of events, can begenerated by repeatedly traversing the generated graph in a randommanner. More specifically, such traversals can commence at randomlyselected nodes and can then proceed in a random manner to subsequentnodes in accordance with the edge values previously determined. Suchtraversals can proceed for a random quantity of steps through the graph.The candidate trajectories can then be filtered to eliminate candidatetrajectories that are impossible or improbable. Such filtering can bebased on a comparison between an individual candidate trajectory and thequantity of occurrences of that candidate trajectory within the logs. Ofthe remaining candidate trajectories, they can be scored based both on aquantity of occurrences of each such candidate trajectory within thelogs, as well as based upon a quantity of steps in each candidatetrajectory. Highly scored candidate trajectories, therefore, canrepresent sequences of events that both occur with sufficient regularitywithin the logged data, and are of an increased length, therebyproviding actionable feedback. As an optimization, prior to thegeneration of a graph from the logs, the logs can be filtered to removeattributes whose values lack repetition or are otherwise too uniquely orevenly spread out to facilitate efficient analysis.

The techniques described herein make reference to “events” and“trajectories”. As utilized herein, the term “event” means any action onthe part of a user or a computing device that is separately logged inthe form of values for each of multiple attributes being logged. Thus,as utilized herein, the term “event” includes transactions between auser and a computing device, or between multiple computing devices, thepresentation of resources, either to users or to other computingdevices, the exchange of messages, or other discrete communications,between users, computing devices, or between one or more users and oneor more computing devices, or the failures thereof, such as exceptions,and other like events. As utilized herein, the term “trajectory” means asequence of events occurring in a conceptually adjacent manner such thata subsequent event is conceptually adjacent to a prior event in thetrajectory. As utilized herein, the term “conceptually adjacent” means aconnected relationship between two events such that, for one or morespecific partitioning attributes, the two events have no interveningevents. Thus, an example of conceptually adjacent events, for thespecific partitioning attribute of a user identifier, are two eventsthat are performed by the same user, identified by the user identifier,one after another in either a temporal or causational manner such thatno logged events were performed by that same user between the twoevents. Another example of conceptually adjacent events, for thespecific partitioning attribute of a session identifier, are two eventsthat a logged sequentially as part of that same session, identified bythe session identifier, such that no logged events of that same sessionwere logged in a sequential manner between the two events. Further tothe definition of conceptually adjacent, as utilized herein, the term“temporally adjacent” means two conceptually adjacent events, as thatterm is defined above, where the adjacency is determined along atimeline metric such that there are no temporally intervening eventsbetween the time when the first of the two temporally adjacent eventsoccurs and the time when the second of the two temporally adjacentevents occurs.

Although not required, the description below will be in the generalcontext of computer-executable instructions, such as program modules,being executed by a computing device. More specifically, the descriptionwill reference acts and symbolic representations of operations that areperformed by one or more computing devices or peripherals, unlessindicated otherwise. As such, it will be understood that such acts andoperations, which are at times referred to as being computer-executed,include the manipulation by a processing unit of electrical signalsrepresenting data in a structured form. This manipulation transforms thedata or maintains it at locations in memory, which reconfigures orotherwise alters the operation of the computing device or peripherals ina manner well understood by those skilled in the art. The datastructures where data is maintained are physical locations that haveparticular properties defined by the format of the data.

Generally, program modules include routines, programs, objects,components, data structures, and the like that perform particular tasksor implement particular abstract data types. Moreover, those skilled inthe art will appreciate that the computing devices need not be limitedto conventional personal computers, and include other computingconfigurations, including hand-held devices, multi-processor systems,microprocessor based or programmable consumer electronics, network PCs,minicomputers, mainframe computers, and the like. Similarly, thecomputing devices need not be limited to stand-alone computing devices,as the mechanisms may also be practiced in distributed computingenvironments where tasks are performed by remote processing devices thatare linked through a communications network. In a distributed computingenvironment, program modules may be located in both local and remotememory storage devices.

With reference to FIG. 1, an exemplary system 100 is illustrated,providing context for the descriptions below. The exemplary system 100can be used to illustrate any number of data transfer systems operatingin both a wide area or local network 101. These networks 101 connect oneor more users 110 to a client system 120. Users 110 can access theclient system 120 from any form of computing device that allows remoteor digital connection to a network 101. A client system 120 can beinclude, but not limited to, a website domain, local management systems,game device systems, communication networks and the like. Users 110access the client system 120 through the network 101 and can eitherenter information through the upload of data 112 or can receiveresponses from the client system 120 in the form of downloaded data 111.Events that occur during the download of data 111 and upload of data 112are unique with reference to the summation of all data contained withinthose events. For example, if the same user 110 performed the sameoperation on the same client system 120, accessing the same webpages andrequested the same information to download, these events would beseparated by the time at which they occur.

The client system 120 can interact with external or internal databases,such as the exemplary database 129 through further download of data 121and upload of data 122. The database 129 can include information having,but not limited to, pricing information, reference directories,geographical information, text files, multimedia content, or imagefiles. The database 129 can be accessed via the client system usingeither local or remote communicational connections. The local storage ofthe database files 129 can independent of the client system 120 or itcan be part of the client system 120.

The download of data 111,121 and upload of data 112,122 can be trackedthrough data logs 130. Data logs 130 can be large collections of columnsof information that record markers, attributes, values, or otheridentifying information about the events triggering, or resulting in,the download of data 111, 121 and upload of data 112, 122. According toone aspect, the logs 130 can be analyzed to identify trends, failurevectors, or otherwise obtain summary data therefrom which can beutilized to improve the functioning of the client system 120, improvethe functionality being exposed by the client system 120 to the users110, increase user engagement with the client system 120, orcombinations thereof.

Log files 130 can be accessed via the analysis system 140 in order toanalyze application health and quality of applications or processeshosted by the client system 120, the interactions of the users 110 withclient system 120, the operation of the database 129, or other likeevents. The log files store can comprise information including, but notlimited to, the geographical data, application version, error codes,operating system and version, device type, and time of access and otherlogged information. The log files 130 can be stored as multiple tablesor table-like structures that organize and store the informationgathered from the events. It is common in large scale applications orclient systems 120 for the quantity of data stored in these logs 130 tobe extremely large, requiring high computing power or time in order toperform analysis on the data. Such analysis typically used on the logfiles includes root cause analysis, telemetry failures, or performancemetrics related to a promised level of quality, such as in hostedsystems. The analysis system 140 can be communicationally coupled to thesame network 101 as the client system 120 and users 110, and can receivethe logs 130 via communications through the network 101. Alternatively,the logs 130 can be provided through other data communicationmechanisms, including the physical coupling of one or more of thecomputing devices of the analysis system 140 to one or more storagemedia comprising the logs 130.

As an example, a user 110 accessing the client system 120, in the formof a provider of online services, could create entries in the logs 130by, for example, submitting a key-word query search in the system andthen browsing one or more results returned by the client system 120.Each entry could, then, comprise an identification of the user, a timestamp, a version of an operating system currently executing on thecomputing device being utilized by the user to access the client system120, a version of a browser executing on the computing device andthrough which the user is accessing the client system 120, a resourcerequested by the user, such as a specific web page, web address, orother like resource identifier, and other identifying or log-ableinformation, including information generated by the client system 120,such as a duration of processing to respond to the user's request, aquantity of memory consumed in responding to the user's request, as wellas identifiers generated to uniquely identify each entry in the logs130. According to one aspect, the specific attributes to be logged canbe determined in advance. Each entry in the logs 130, therefore, can becomprised of values for those attributes. Conceptually, the logs 130 canbe visualized as tables, with the attributes being the headings ofindividual columns, and each row being a separately logged event. Aswill be recognized by those skilled in the art, however, the actualstructure of the data, as stored on storage media, within the logs 130,need not be in tabular form.

The analysis system 140 can be part of the same local network of theclient system 120 and database 129, can be part of the same computingdevice or set of computing devices acting in aggregate that also hostthe client system 120, the database 129, or combinations thereof, or canbe remote from one or both of the client system 120 and database 129.The network 101 can provide a communicational connection between theclient system 120, the database 129, and the analysis system 140.

With reference to FIG. 2, a block diagram 200 illustrates an exemplaryset of components that can create dominant sequences of logged events inthe form of candidate trajectories. The output of the system 200 can bethe scored candidate trajectories 250 that can be representative of thelarger population of data in the log files 210, but in a format that ismore easily consumable and analyzable to identify sequences of interest.This can be accomplished through reducing the number of attributes andcreating a graph, such as the graph 240, from which candidatetrajectories can be artificially generated and then verified prior tobeing scored.

Initially, after the log files 210 are obtained, an attribute reducer,such as the exemplary attribute reducer 220, can remove certainattributes to reduce the quantity of data to be analyzed. This canincrease the speed at which following computations can be performed, asa reduction in the amount of data being analyzed reduces the burden onthe cores of the CPU. Attributes to be removed can be identified byapplying a threshold value upon the distinctness of attribute values,such as, for example, by comparing a quantity of unique attribute valuesto a total quantity of log entries. For example, if each logged eventhad assigned to it a unique identifier, then the quantity of uniquevalues of such an identifier can be the same as the quantity of logentries themselves. Accordingly, such an attribute can be removed by theattribute reducer 220. As another example, if each logged event includedan indication of an operating system type, there may be only ahalf-dozen or so unique values even though the quantity of log entriescould be tens of thousands or more. Because the ratio of unique valuesof such an attribute as compared with the total quantity of log entriesis low, that attribute can be retained by the attribute reducer 220.

Another filtering option to reduce the quantity of data is to apply afiltering option based on a quantity of a most common attribute value ascompared with a total quantity of log entries. More specifically,individual rows, or entries, can be sorted based on attribute valuessuch that attribute values of an attribute being analyzed, that areequivalent to one another, can be sorted adjacent to one another.Quantities of equivalent attribute values can then be tallied and thequantity of the most commonly occurring attribute value can be comparedwith a total quantity of entries in the logs. If such a ratio is toolow, suggestive of many unique values of such an attribute, thatattribute can be removed by the attribute reducer 220. Sorting in thismethod could place all of the most commonly occurring events at the topof the sorting filter by the desired attribute and placing all of thefewer occurring events at the bottom. This sorting method would, again,facilitate the removal of data based on attributes whose values are notsufficiently repetitive among the individual log entries.

The filtering performed by the exemplary attribute reducer 220 canremove both non-discrete event attributes and unique events. Examples ofdata that may be removed include, but are not limited to, the keys,indexes, time stamps and the like. Such data can be inherently unique toeach event and may not relate to subsequent events being analyzed fortrajectories. Removing these columns of data can reduce the computationrequired for analysis.

In addition to removing whole attributes, analogous to removing wholecolumns from a table, the exemplary attribute reducer 220 can alsoremove individual attribute values while still retaining the conceptualcolumn. Again, the reduction of data can aid in the efficiency ofsubsequent processing.

Subsequently, a graph builder, such as the exemplary graph builder 230,can build graph from the log entries, where such a graph can be builtbased on one or more specific partitioning attributes that delineate aframework within which logged events will be evaluated to determinewhether or not they are conceptually adjacent to one another forpurposes of connecting, with edges between them, pairs of nodes of thegraph, where the graph itself is comprised of the nodes and theconnecting edges. Nodes can be denoted to be a unique attribute-valuepair, while the edges can represent a progression from one node toanother, the two nodes representing logged events that are conceptuallyadjacent within the framework of the one or more specific partitioningattributes. Nodes can be weighted by the quantity of events having thatspecific attribute-value pair that are processed by the graph builder230 and edges can be weighted by the quantity of progressions along suchan edge by the events from the log files 210 that are processed by thegraph builder 230.

As an example, a partitioning attribute can be a user identifier, suchthat each user's logged events are viewed independently of anotheruser's logged events for purposes of building the graph and anattribute, whose attribute-value pairs can define nodes, may be aresource, such as a web page address, accessed or requested by a userhaving a specific user identifier. An individual node, in such anexample, can be a specific value for that attribute, such as a specificresource. Thus, if the log files 210 contained an entry of that specificresource being requested, such an entry can cause the graph builder 230to either create a node corresponding to that attribute-value pair,namely with the attribute being requested resources and the value beingthe specific resource requested by that entry, or to increment a countof such a node if that node already exists in the graph 240, such as bythe graph builder 230 having created it previously. Another entry fromthe log files 210, logging the request of another, different resource,can result in the creation of, or in incrementing the count of, anothernode. If the two nodes are conceptually adjacent within the framework ofthe one or more specific partitioning attributes, such as if there is atemporal or causational relationship between the two nodes within theframework of a specific user, such as if the same user first requestedone resource and then requested another without any other resourcerequest event being logged temporally between those two, an edge can becreated between those two nodes by the graph builder 230, or a count ofan already existing edge can be incremented. Edges that connect to andfrom nodes can show temporal connections and trajectories related to thenodes, such as which resources were requested after which otherresources by a single user. For example, if the second resource wasrequested from the first resource, such as by following a hyperlink,such an action can indicate a causational relationship between the twonodes corresponding to the requesting of the first resource and thensubsequently the second resource and, correspondingly, the graph builder230 can generate, or increment the count of, an edge between thecorresponding nodes. As another example, if the second resource wasrequested by the same user immediately after that user requested thefirst resource, with the term “immediately” being utilized to mean thatthere were no intervening logged resource requesting events from thatsame user, such an action can also indicate a causational relationshipbetween the two nodes corresponding to the requesting of the firstresource and then subsequently the second resource.

The graph data 240 that is generated is represented by nodes, markingevents that have occurred, and edges, marked the trajectories from oneevent to another. Such a representation of the data can be show thefrequency of specific events, or values within attributes, and thelikelihood of said event leading to another, or the trajectory which itis most likely to follow. The nodes are attribute-value pairscorresponding to events registered in logged files and the edges aretemporal or causational connections between such events, relatingchanges in attribute-value pairs. Edges may be expressed in a weightingscale dependent upon the frequency of occurrence over the amount of dataanalyzed, such as a probability determined through the weighting of allother nodes to which edges proceed from that particular node.

As an example, denoting requested resources as variable letters, a userinteracting with a system can request a resource A and can then proceedsto request a resource B. Another user, with a different unique user ID,can also accesses resource A, but instead can proceed to resource C,instead of B. A graph representation of this example, with useridentifiers being the specific partitioning attribute within whichframework the graph is being generated, could comprise a nodecorresponding to the resource A, with a count, or value, of two and withedges leading to nodes corresponding to the resources B and C, each witha weight or count of one. Thus, of the edges departing the nodecorresponding to resource A, fifty percent proceed to the nodecorresponding to the resource B and fifty percent proceed to the nodecorresponding to the resource C. These values can be represented aseither population numbers, or weights, or percentages related to thetotal population of events analyzed.

Following the development of the graph 240, a candidate trajectorygenerator, such as the exemplary candidate trajectory generator 280 canutilize the graph 240 to artificially generate candidate trajectoriesthrough the graph 240. These candidate trajectories are generated toperform, what are referred to herein as, “random walks”. Random walksare comprised of an ordered sequence of nodes from the graph 240 suchthat, conceptually, the “walk” is seen as progressing from one “step” toanother, where each “step” is a node and where the next node isconnected to the prior node by an edge. The “walks” are “random” in thatthey can commence on a randomly selected node, they can proceed in arandom manner to a subsequent node, in accordance with the weightingdescribed previously, and can terminate after a random quantity ofnodes, or “steps”.

The candidate trajectory generator 280 can initiate the formation ofcandidate trajectories over the nodes by selecting a random node as astarting point for one such candidate trajectory, generating thecandidate trajectory, as detailed below, then selecting another randomnode as a starting point for the next candidate trajectory, and so on.Starting nodes can be randomly selected according to the frequency ofthe events in the raw data, or a weighted sampling of the discreteattributes. Thus, for example, a node that has a count or weighting thatis twice that of another node can be randomly selected approximatelytwice as often as an initial, starting node for a candidate trajectory.Alternatively, the randomly selected nodes, selected to start individualcandidate trajectories, can be randomly selected from among some or allof the nodes in the graph 240 without regard to the previouslydetermined weights or counts.

Following weighted percentages, likelihood of occurrences, and possibletrajectories between nodes, the candidate trajectory generator 280 canfollow edges randomly. More specifically, the randomly selected edge,leading from a current node in the candidate trajectory beingconstructed by the candidate trajectory generator 280, can be randomlyselected based on a score or weight assigned to the edges leading fromthat current node. As an example, if beginning at a node and that nodehas two edges proceeding from it, one possessing a weight of ninetypercent and the other of ten percent, then randomly proceeding forwardten times should result in the former edge being selected approximatelynine times and the latter edge being selected approximately once. Aswill be recognized by those skilled in the art, this is not a guarantee,as weighting only predicts the possibility and is not meant to be seenas a guarantee of path of a candidate trajectory being generated by thecandidate trajectory generator 280.

Aside from the first node in the trajectory generator, the number ofsteps can also be randomly chosen. The number of steps may be given anupper or lower limit which can be informed based on the nature of thelog files 210, or can be adjusted based on previously generatedcandidate trajectories.

The candidate trajectories generated by the candidate trajectorygenerator 280 are artificially created sequences generated from thegraph 240 and are not actual trajectories selected from the log files210. In other words, the candidate trajectory generator 280 is notmerely filtering the log files 210 themselves. Consequently, thecandidate trajectories generated by the candidate trajectory generator280 can be generated more efficiently than filtering of the log files210, including consuming substantially less processor and memoryresources, since, as indicated the log files 210 can comprise large datasets. Additionally, subsequent analysis of the candidate trajectoriescan also be performed more efficiently and, therefore, increase theefficiency of the scanning process of the logged data. This is due atleast in part because the graph data 240 is small compared to the logfiles 210. The difference in size is noted to be smaller but can becontrolled by thresholding the values of attributes. Lower thresholdscan increase the size of the graph while higher thresholds can removemore information and therefore decrease the size of the graph, therebyalso potentially decreasing the time to generate candidate trajectories280, though possibly at the cost of reduced accuracy or completeness.

A candidate trajectory verifier, such as the exemplary candidatetrajectory verifier 270, can receive the candidate trajectories from thecandidate trajectory generator 280 and can further receive the loggeddata, such as after reduced by the attribute reducer 220, as illustratedby the system 200 of FIG. 2. The verifier 270 can test the validity ofthe candidate trajectories generated by the candidate trajectorygenerator 280 against the logged events to remove candidate trajectoriesthat either have never occurred, as indicated by the logged events fromthe log files 210, or have occurred sufficiently infrequently that theyare below a predetermined frequency threshold. Random walks along thegenerated candidate trajectories 280 can sometimes comprise a sequenceof events, or steps, that is either impossible, or improbable. This canbe due to the nature of the random walks beginning at randomly assignednodes and proceeding along weighted edges. Further, edges represent onlythe temporal movement between values of an attribute logged. This maylead to values existing in attributes related to activity logged inanother event. More specifically, a random walk through the graph 240may generate a sequence of events that relates two nodes that cannothappen without the previous confirmation of a prior node that was not,actually part of the walk. As these trajectories are impossible tooccur, they can be removed by the exemplary candidate trajectoryverifier 270.

For example, a user who has requested a resource B can be provided theopportunity to request a resource C only if the user had requested theresource B from a prior resource X. Users who requested the sameresource B from any other prior resource, such as the resource A, on theother hand, could not be allowed to request the resource C and would,instead, in such an illustrative example, only be allowed to request theresource Y. Thus, a node representative of the requesting of theresource B could have two edges proceeding from it, one to the noderepresenting the resource C and another to the node representing theresource Y. Similarly, the node representing the resource B can have twoedges terminating at such a node: one from the node representing theresource A and the other from the node representing the resource X.Again, in this example, X-B-C can be a valid sequence, since, in thisexample, a user who has requested the resource B can be provided theopportunity to request a resource C only if the user had requested theresource B from the resource X. Similarly, A-B-Y can, for the samereason, be a valid sequence. A random walk, however, starting at thenode representing the resource A can randomly proceed to the noderepresenting the resource B and can from there randomly proceed to thenode representing the resource C, since the node representing theresource B has an edge originating from it and terminating at the noderepresenting the resource C. However, as indicated, in this illustrativeexample, A-B-C can be an invalid sequence since only users requestingthe resource B from the prior resource X can be allowed to request theresource C. Consequently, a comparison to the logged data, by thecandidate trajectory verifier 270, can reveal that the candidatetrajectory A-B-C never occurred within the logged data, since, again, inthe present example, it can be an impossible trajectory, and,consequently, due to its lack of occurrence within the logged data, thecandidate trajectory verifier 270 can filter out such a candidatetrajectory.

Following the removal of candidate trajectories by the candidatetrajectory verifier 270, a candidate trajectory score generationcomponent, such as the exemplary candidate trajectory score generationcomponent 260 can assign a ranking, or score, to at least some of thecandidate trajectories remaining after the candidate trajectory verifier270, and can output the scored candidate trajectories 250. According toone aspect, such a scoring, or ranking, can take into account the lengthof a candidate trajectory and a frequency of its occurrence.Trajectories, representing sequences of events, that have a greaternumber of steps can be more desirable, and thus, can be rated higher.The frequency of similar sequences of events, as logged in the log files210, can also be rated higher. Thus, the most highly ranked candidatetrajectories can represent those that occurred more often, and also areof a sufficiently long sequence of steps, or events, to enable usableoptimizations or improvements of the client system to be gleanedtherefrom. This process is not limited to finding errors in a clientsystem 120 or database 129, but can also be used to predict the mostlikely trajectory users will take to reach a specific event, or otherlike analysis.

For example, an online supplier may use the exemplary system to analyzethe events leading to access of a specific resource, or the failure toaccess a specific resource. The scored candidate trajectories 250 outputby the candidate trajectory score generation component 260 can beutilized to identify the most likely mechanisms, and sequences of steps,by which that specific resource is accessed, or, conversely, the mostlikely sequence resulting in the failure to access that resource.

Moving to FIG. 3, the system 300 illustrates one mechanism forgenerating a graph, such as the exemplary graph 302, from logged data,such as the exemplary logged data 301. Rows 311, 312, 313, 314, 315,316. 317 and 318 can represent individual events logged, such as thosemore generally referenced above. Columns 321, 322, 323, 324, 325 and 326can be logged attributes whose values are recorded for each event. Thecolumns 321, 322, 323, 324, 325 and 326, therefore, can indicateattributes capable of being analyzed, but are exemplary only and are notrequirements of the log files. Similarly, the attributes recorded caninclude, but are not limited to, date or time on resource acquisition,resource size and other like information. Though they are so illustratedin the exemplary system 300, the rows 311, 312, 313, 314, 315, 316. 317and 318 of example log data 301 are not required to have values for allattributes listed in columns 321, 322, 323, 324, 325 and 326. Forexample, if an additional column were created to reference an error codecreated via a user created event, the value of the column could be blankor filled in with a non-discrete marker to indicate no such erroroccurred during the logged event.

The graph 302 can illustrate the creation of a graph, namely the graph302, that is representative of the logged data 301 based on a specificpartitioning attribute, such as in the manner of the graph generationdescribed above. The figures presented in the graph 302 can represent anexample analysis of the resource column 326 with the UserName attributefrom the UserName column 322 acting as the partitioning attribute. Morespecifically, nodes 331,332, 333, 334, 334, 335 and 336 can berepresentative of events from the resource column 326 as sequentiallyrequested by discrete users identified based on the UserName attribute.The graph 302 can further have temporal edges 341, 342, 343, 344 and 345representative of the trajectory of attribute-value nodes, showing thetrajectory of events from logged data 301, whose conceptual adjacencycan be derived from the logged data, such as from the time attribute 323in combination with the partitioning attribute.

Events from logged data 301 rows 311, 312, 313, 314, 315, 316. 317 and318 show that resource column 326, having values generically denoted “X”and “Y” can be temporally linked in that a same user, as indicated byvalues in the UserName column 322, which, again, is the partitioningattribute, is temporally associated with the access of both theresources “X” and “Y”. Similarly, resource column 326, having valuesgenerically denoted “A”, “B”, “C” and “D” can be temporally linked inthat a same user, as indicated by values in the UserName column 322,which is the partitioning attribute in the present example, istemporally associated with their access. For example, the user nominatedby the UserName value “Izzy”, shown in event rows 311, 313 and 314 canbe seen as initially requesting resource A, as illustrated by event row311, then proceeding to request resource C, as illustrated by event row313, and, subsequently, requesting resource D, as illustrated by eventrow 314. In the graph 302, therefore, nodes 334, 335 and 336 canrepresent the events logged with Izzy's UserName, namely the requestingof the resources A, C and D, respectively, and edges 344 and 343 canrepresent the trajectory of the events present in the logged data 301,as detailed previously. As another example, the user nominated by theUserName value “DanV”, can, as illustrated by event rows 316 and 318initially request the resource X and can subsequently request theresource Y. These are represented with nodes 331 and 332, respectivelyand a single edge 341. As yet another example, the user nominated by theUserName value “MegN”, can, as illustrated by event rows 312, 315 and317, also initially request the resource A, much like user Izzy did, aslogged by event row 311, but the user MegN can then subsequently requestthe resource B, instead of the resource C that was subsequentlyrequested by the user Izzy, and can only then proceed to request theresource C, as illustrated by event row 317. The exemplary graph 302,therefore, illustrates an edge 344 from node 336 to node 335, and alsoan edge 345 from node 336 to node 333. The exemplary graph 302 alsoillustrates an edge 342, then, from the node 333 to the node 335.

Referring to FIG. 4, a flow diagram 400, of an exemplary sequence ofsteps for artificially creating dominant sequences that arerepresentative of logged events, is shown. Initially, at step 410, oneor more log files can be received. The log files received at step 410may be events relating to users, client systems, databases and otherlike events, such as those described previously. The log files receivedat step 410 can contain a terminology of events, summarized as atransaction between the users, client system, and database. An analysissystem is able to bring these files together for the processing of thedata as described previously and herein. The removal of the attributesat step 420 can follow, in which non-discrete datasets and values canremoved from the compilation of log files in order to reduce theresources required to process the data and remove inapplicable, orincompatible data. Data sets may also be removed based on, but notlimited to, thresholding values that occur below a given percent of thetotal attribute population, unique events or markers that do not offersignificance to the events, or are classified as unimportant to theattribute being analyzed. The method of filtering and limitationstherein are to be made and used at the operator's discretion.

The data follows the flow chart 400 to a building graphs step 430, wherea graph comprising nodes and edges can be built from the logged data,subsequent to the step 420, based on a partitioning attribute thatdefines the framework within which logged events will be evaluated todetermine whether or not they are conceptually adjacent to one anotherfor purposes of connecting, with edges between them, pairs of nodes ofthe graph, where the graph itself is comprised of the nodes and theconnecting edges. As indicated previously, each node in the graphconstructed at step 430 can correspond to an attribute-value pair andeach edge between nodes can indicate two or more events that areconceptually adjacent as that term was explicitly defined above. Thesenodes and edges can be weighted based upon their incidence and quantityof appearance in the logged data. That is, if an attribute-value pairoccurs multiple times in the logged data, the corresponding node can beweighted, or scored, accordingly, and, analogously, if multipledifferent sequences of events indicate that an event corresponding to afirst node and an event corresponding to a second node are conceptuallyadjacent, then the edge between them can be weighted, or scored,accordingly, as detailed above. The system can generate the nodes firstthrough the comparison of all values in the desired attribute, thencreating the edges by walking through events, plotting conceptuallyadjacent sequences. New edges can be created when new sequences arediscovered through the random walking of the graph data set.Alternatively, the system can create the edges and nodes concurrentlythrough a sequential analysis of the logged data. Values, or counts ofoccurrence, of edges and nodes can be represented as either percentagesof the total population or as discrete quantities or weights.

Subsequently, at step 440, the graph generated at step 440 can betraversed in a random manner to generate candidate trajectories. Thatis, a series of trajectories can begin at any node, selected randomly,and continue for a randomly specified number of steps, herein referringto the number of edges the trajectory moves across. The path of thesetrajectories can adhere to the percentage likelihood of occurrence,related to the weighting of the edges between respective nodes. Forexample, as illustrated previously, if the trajectory begins at node Aten times and is offered to travel along one edge towards node B, whichoccurs ninety percent of the time, and node C, which occurs ten percentof the time, the trajectory can, randomly be selected to proceed to nodeB approximately nine times and to node C approximately once. The initialnode at which the trajectory begins can be selected at random and eithercan be based on weighting, or scores, applied to individual nodes, orcan be weight agnostic. Similarly, the initially selected node can beselected from a defined subset or from the entire graph. It is to benoted that due to the nature to which this algorithm can be applied, itis possible for candidate trajectories to be generated and be impossiblefor the system to replicate. This is due to the nature of starting innodes previously accessed through only a specific order of nodes oraccessing nodes in the random sequencing which require another node notaccessed.

The removal of improbable or impossible trajectories generated at step440 can be performed at step 450. The trajectories generated at step 440can, at step 450, be compared to the logged data received at step 410.This second scan may compare the trajectories generated to thetrajectories existing within the data. The removal of trajectories isnot limited to impossible trajectories, or trajectories that never occurwithin the logged data received at step 410. Trajectories may also beremoved for failing to appear in the logged data greater than athreshold quantity of times.

Following the removal of the trajectories, a score can be assigned forthe remaining candidate trajectories at step 460. This score can bebased upon the number of times a given trajectory occurred within thelogged data received at step 410, the number of steps taken within saidtrajectory, or combinations thereof. A greater number of steps in atrajectory can be perceived to increase its ultimate value as ananalysis instrument, as it represents greater data to be understood bythe analysis system and its operator. This information can be stored andsubsequently output as trajectories and their associated score at step470.

Turning to FIG. 5, an exemplary computing device 500 is illustratedwhich can perform some or all of the mechanisms and actions describedabove. The exemplary computing device 500 can include, but is notlimited to, one or more central processing units (CPUs) 520, a systemmemory 530, and a system bus 521 that couples various system componentsincluding the system memory to the processing unit 520. The system bus521 may be any of several types of bus structures including a memory busor memory controller, a peripheral bus, and a local bus using any of avariety of bus architectures. The computing device 500 can optionallyinclude graphics hardware, including, but not limited to, a graphicshardware interface 570 and a display device 571, which can includedisplay devices capable of receiving touch-based user input, such as atouch-sensitive, or multi-touch capable, display device. Depending onthe specific physical implementation, one or more of the CPUs 520, thesystem memory 530 and other components of the computing device 500 canbe physically co-located, such as on a single chip. In such a case, someor all of the system bus 521 can be nothing more than silicon pathwayswithin a single chip structure and its illustration in FIG. 5 can benothing more than notational convenience for the purpose ofillustration.

The computing device 500 also typically includes computer readablemedia, which can include any available media that can be accessed bycomputing device 500 and includes both volatile and nonvolatile mediaand removable and non-removable media. By way of example, and notlimitation, computer readable media may comprise computer storage mediaand communication media. Computer storage media includes mediaimplemented in any method or technology for storage of content such ascomputer readable instructions, data structures, program modules orother data. Computer storage media includes, but is not limited to, RAM,ROM, EEPROM, flash memory or other memory technology, CD-ROM, digitalversatile disks (DVD) or other optical disk storage, magnetic cassettes,magnetic tape, magnetic disk storage or other magnetic storage devices,or any other medium which can be used to store the desired content andwhich can be accessed by the computing device 500. Computer storagemedia, however, does not include communication media. Communicationmedia typically embodies computer readable instructions, datastructures, program modules or other data in a modulated data signalsuch as a carrier wave or other transport mechanism and includes anycontent delivery media. By way of example, and not limitation,communication media includes wired media such as a wired network ordirect-wired connection, and wireless media such as acoustic, RF,infrared and other wireless media. Combinations of the any of the aboveshould also be included within the scope of computer readable media.

The system memory 530 includes computer storage media in the form ofvolatile and/or nonvolatile memory such as read only memory (ROM) 531and random access memory (RAM) 532. A basic input/output system 533(BIOS), containing the basic routines that help to transfer contentbetween elements within computing device 500, such as during start-up,is typically stored in ROM 531. RAM 532 typically contains data and/orprogram modules that are immediately accessible to and/or presentlybeing operated on by processing unit 520. By way of example, and notlimitation, FIG. 5 illustrates operating system 534, other programmodules 535, and program data 536.

The computing device 500 may also include other removable/non-removable,volatile/nonvolatile computer storage media. By way of example only,FIG. 5 illustrates a hard disk drive 541 that reads from or writes tonon-removable, nonvolatile magnetic media. Otherremovable/non-removable, volatile/nonvolatile computer storage mediathat can be used with the exemplary computing device include, but arenot limited to, magnetic tape cassettes, flash memory cards, digitalversatile disks, digital video tape, solid state RAM, solid state ROM,and other computer storage media as defined and delineated above. Thehard disk drive 541 is typically connected to the system bus 521 througha non-volatile memory interface such as interface 540.

The drives and their associated computer storage media discussed aboveand illustrated in FIG. 5, provide storage of computer readableinstructions, data structures, program modules and other data for thecomputing device 500. In FIG. 5, for example, hard disk drive 541 isillustrated as storing operating system 544, other program modules 545,and program data 546. Note that these components can either be the sameas or different from operating system 534, other program modules 535 andprogram data 636. Operating system 544, other program modules 545 andprogram data 546 are given different numbers hereto illustrate that, ata minimum, they are different copies.

The computing device 500 may operate in a networked environment usinglogical connections to one or more remote computers. The computingdevice 500 is illustrated as being connected to the general networkconnection 561 through a network interface or adapter 560, which is, inturn, connected to the system bus 521. In a networked environment,program modules depicted relative to the computing device 500, orportions or peripherals thereof, may be stored in the memory of one ormore other computing devices that are communicatively coupled to thecomputing device 500 through the general network connection 561. It willbe appreciated that the network connections shown are exemplary andother means of establishing a communications link between computingdevices may be used.

Although described as a single physical device, the exemplary computingdevice 500 can be a virtual computing device, in which case thefunctionality of the above-described physical components, such as theCPU 520, the system memory 530, the network interface 560, and otherlike components can be provided by computer-executable instructions.Such computer-executable instructions can execute on a single physicalcomputing device, or can be distributed across multiple physicalcomputing devices, including being distributed across multiple physicalcomputing devices in a dynamic manner such that the specific, physicalcomputing devices hosting such computer-executable instructions candynamically change over time depending upon need and availability. Inthe situation where the exemplary computing device 500 is a virtualizeddevice, the underlying physical computing devices hosting such avirtualized computing device can, themselves, comprise physicalcomponents analogous to those described above, and operating in a likemanner. Furthermore, virtual computing devices can be utilized inmultiple layers with one virtual computing device executing within theconstruct of another virtual computing device. The term “computingdevice”, therefore, as utilized herein, means either a physicalcomputing device or a virtualized computing environment, including avirtual computing device, within which computer-executable instructionscan be executed in a manner consistent with their execution by aphysical computing device. Similarly, terms referring to physicalcomponents of the computing device, as utilized herein, mean eitherthose physical components or virtualizations thereof performing the sameor equivalent functions.

The descriptions above include, as a first example a set of one or morecomputing devices, in aggregate comprising: one or more processingunits; and one or more computer-readable media comprisingcomputer-executable instructions which, when executed by the one or moreprocessing units, cause the set of computing devices to: receive one ormore logs that comprise values of predefined attributes and, thereby,log multiple discrete events, wherein a single discrete event is loggedwith a single value for each of at least some of the predefinedattributes; generate, from at least some of the received one or morelogs, a graph comprising multiple nodes and edges between pairs ofnodes, each node representing a unique attribute-value pair; produce aset of candidate trajectories, each candidate trajectory representing asequence of events, by repeatedly traversing the generated graphstarting from a randomly selected node and randomly proceeding tosubsequent nodes, in accordance with edge values; generate a filteredset of candidate trajectories by removing candidate trajectories which,when compared with at least some of the received one or more logs, occurin the at least some of the received one or more logs less than athreshold amount; and provide, as output responsive to the receipt ofthe one or more logs, at least some of the filtered set of candidatetrajectories, wherein each provided candidate trajectories is associatedwith a score based on a quantity of steps in the provided candidatetrajectory and a quantity of occurrences of the provided candidatetrajectory in the at least some of the received one or more logs.

A second example is the set of computing devices of the first example,wherein the one or more computer-readable media comprise furthercomputer-executable instructions, which, when executed by the one ormore processing units, cause the set of computing devices to: remove oneor more of the predefined attributes, and the corresponding values, fromthe one or more logs prior to the generating the graph; wherein thegraph is generated from the at least some of the received one or morelogs after the removed one or more predefined attributes are removedtherefrom.

A third example is the set of computing devices of the second example,wherein the removed one or more predefined attributes are selected to beremoved because a quantity of different values of each of the removedone or more predefined attributes exceeds a threshold.

A fourth example is the set of computing devices of the second example,wherein the one or more computer-readable media comprise furthercomputer-executable instructions, which, when executed by the one ormore processing units, cause the set of computing devices to: remove oneor more values of the predefined attributes that remain as part of thereceived one or more logs after the removed one or more predefinedattributes are removed therefrom.

A fifth example is the set of computing devices of the first example,wherein the computer-executable instructions for generating the graphcomprise computer-executable instructions, which, when executed by theone or more processing units, cause the set of computing devices to:identify a first event within the received one or more logs; identify,within the received one or more logs, a second event that isconceptually adjacent to the first event given at least one partitioningattribute that delineates a framework within which logged events areevaluated to determine whether or not they are conceptually adjacent toone another; generate a first node corresponding to the first event, ifnot already generated; generate a second node corresponding to thesecond event, if not already generated; generate a first edge from thefirst node to the second node, if not already generated; and increment acount associated with the first edge if already generated.

A sixth example is the set of computing devices of the fifth example,wherein the identification of the second event as being conceptuallyadjacent to the first event is based on a same user participating in thefirst event and then immediately subsequently participating in thesecond event, the immediately subsequently being determined by referenceto a time attribute from the received one or more logs, the at least onepartitioning attribute being a user identifying attribute by which thesame user is distinguished from other users.

A seventh example is the set of computing devices of the fifth example,wherein the first event is a presentation of a first resource to a userand the second event is a presentation of a second resource to the sameuser, the at least one partitioning attribute being a user identifyingattribute by which the same user is distinguished from other users.

An eighth example is the set of computing devices of the seventhexample, wherein the first resource is a first web resource and thesecond resource is second web resource requested by the user through thefirst web resource.

A ninth example is the set of computing devices of the first example,wherein the computer-executable instructions for producing the set ofcandidate trajectories comprise computer-executable instructions, which,when executed by the one or more processing units, cause the set ofcomputing devices to traverse, for each candidate trajectory in the setof candidate trajectories, the generated graph for a random quantity ofsteps, the random quantity of steps being determined prior to commencingthe traversal of the generated graph for that candidate trajectory.

A tenth example is the set of computing devices of the ninth example,wherein the traversal of the generated graph ends at a node having noedges departing therefrom, even if the random quantity of steps has notyet been fully taken.

An eleventh example is the set of computing devices of the firstexample, wherein the score is exponentially higher for incrementallygreater quantities of steps.

A twelfth example is a method of artificially creating dominantsequences that are representative of logged events, the methodcomprising: receiving, at a set of one or more computing devices, one ormore logs that comprise values of predefined attributes and, thereby,log the logged events, wherein a single discrete event is logged with asingle value for each of at least some of the predefined attributes;generating, on the set of one or more computing devices, from at leastsome of the received one or more logs, a graph comprising multiple nodesand edges between pairs of nodes, each node representing a uniqueattribute-value pair; producing, with the set of one or more computingdevices, a set of candidate trajectories, each candidate trajectoryrepresenting a sequence of events, by repeatedly traversing thegenerated graph starting from a randomly selected node and randomlyproceeding to subsequent nodes, in accordance with edge values;generate, on the set of one or more computing devices, a filtered set ofcandidate trajectories by removing candidate trajectories which, whencompared with at least some of the received one or more logs, occur inthe at least some of the received one or more logs less than a thresholdamount; and provide, from the set of one or more computing devices, asoutput responsive to the receipt of the one or more logs, at least someof the filtered set of candidate trajectories, wherein each providedcandidate trajectories is associated with a score based on a quantity ofsteps in the provided candidate trajectory and a quantity of occurrencesof the provided candidate trajectory in the at least some of thereceived one or more logs.

A thirteenth example is the method of the twelfth example, furthercomprising: removing one or more of the predefined attributes, and thecorresponding values, from the one or more logs prior to the generatingthe graph; wherein the graph is generated from the at least some of thereceived one or more logs after the removed one or more predefinedattributes are removed therefrom.

A fourteenth example is the method of the thirteenth example, whereinthe removed one or more predefined attributes are selected to be removedbecause a quantity of different values of each of the removed one ormore predefined attributes exceeds a threshold.

A fifteenth example is the method of the twelfth example, wherein thegenerating the graph comprises: identifying a first event within thereceived one or more logs; identifying, within the received one or morelogs, a second event that is conceptually adjacent to the first eventgiven at least one partitioning attribute that delineates a frameworkwithin which logged events are evaluated to determine whether or notthey are conceptually adjacent to one another; generating a first nodecorresponding to the first event, if not already generated; generating asecond node corresponding to the second event, if not already generated;generating a first edge from the first node to the second node, if notalready generated; and incrementing a count associated with the firstedge if already generated.

A sixteenth example is the method of the fifteenth example, wherein theidentification of the second event as being conceptually adjacent to thefirst event is based on a same user participating in the first event andthen immediately subsequently participating in the second event, theimmediately subsequently being determined by reference to a timeattribute from the received one or more logs, the at least onepartitioning attribute being a user identifying attribute by which thesame user is distinguished from other users.

A seventeenth example is the method of the fifteenth example, whereinthe first event is a presentation of a first web resource to a user andthe second event is a presentation of a second web resource to the sameuser, the second web resource being requested by the user through thefirst web resource, the at least one partitioning attribute being a useridentifying attribute by which the same user is distinguished from otherusers.

An eighteenth example is the method of the twelfth example, wherein theproducing the set of candidate trajectories comprises traversing, foreach candidate trajectory in the set of candidate trajectories, thegenerated graph for a random quantity of steps, the random quantity ofsteps being determined prior to commencing the traversal of thegenerated graph for that candidate trajectory.

A nineteenth example is the method of the twelfth example, wherein thescore is exponentially higher for incrementally greater quantities ofsteps.

A twentieth example is one or more computer-readable storage mediacomprising computer-executable instructions which, when executed by oneor more processing units of a computing device, cause the computingdevice to: receive one or more logs that comprise values of predefinedattributes and, thereby, log multiple discrete events, wherein a singlediscrete event is logged with a single value for each of at least someof the predefined attributes; generate, from at least some of thereceived one or more logs, a graph comprising multiple nodes and edgesbetween pairs of nodes, each node representing a unique attribute-valuepair; produce a set of candidate trajectories, each candidate trajectoryrepresenting a sequence of events, by repeatedly traversing thegenerated graph starting from a randomly selected node and randomlyproceeding to subsequent nodes, in accordance with edge values; generatea filtered set of candidate trajectories by removing candidatetrajectories which, when compared with at least some of the received oneor more logs, occur in the at least some of the received one or morelogs less than a threshold amount; and provide, as output responsive tothe receipt of the one or more logs, at least some of the filtered setof candidate trajectories, wherein each provided candidate trajectoriesis associated with a score based on a quantity of steps in the providedcandidate trajectory and a quantity of occurrences of the providedcandidate trajectory in the at least some of the received one or morelogs.

As can be seen from the above descriptions, mechanisms for artificiallycreating dominant sequences that are representative of logged eventshave been presented. In view of the many possible variations of thesubject matter described herein, we claim as our invention all suchembodiments as may come within the scope of the following claims andequivalents thereto.

1-20. (canceled)
 21. A set of one or more computing devices, inaggregate comprising: one or more processing units; and one or morecomputer-readable media comprising computer-executable instructionswhich, when executed by the one or more processing units, cause the setof computing devices to: randomly select an initial node from a graphwhose nodes represent attribute-value pairs from a log of events; andgenerate a trajectory, that is an artificially created sequencerepresentative of events logged in the log, by iteratively adding nodesto the trajectory, each iteration comprising: treating an immediatelypreviously added node as a current node; randomly selecting an edge inaccordance with edge values assigned to edges proceeding from thecurrent node, the randomly selected edge connecting the current node toa subsequent node; and adding the subsequent node to the trajectory;wherein the log comprises, for each individual event of the eventslogged in the log, attribute values associated with each individualevent; wherein edges between the nodes in the graph representconnections between two events logged in the log, a starting node of anedge representing attribute-value pairs of a first of the two events andan ending node of the edge representing attribute-value pairs of asecond of the two events; wherein an edge value of the edge represents aquantity of times the attribute-value pairs of the starting node and theending node were associated with two connected events logged in the log;and wherein the trajectory commences at the initial node and proceedsthrough the graph.
 22. The set of computing devices of claim 21, whereinthe one or more computer-readable media comprise furthercomputer-executable instructions, which, when executed by the one ormore processing units, cause the set of computing devices to: generatemultiple trajectories; and generate a filtered set of trajectories byremoving, from the generated multiple trajectories, trajectories which,when compared with the log, occur less than a threshold amount.
 23. Theset of computing devices of claim 22, wherein the one or morecomputer-readable media comprise further computer-executableinstructions, which, when executed by the one or more processing units,cause the set of computing devices to: generate output comprising atleast some of the filtered set of trajectories, wherein each outputtrajectory is associated with a score based on a quantity of steps inthe output trajectory and a quantity of occurrences of the outputtrajectory in the log.
 24. The set of computing devices of claim 21,wherein the one or more computer-readable media comprise furthercomputer-executable instructions, which, when executed by the one ormore processing units, cause the set of computing devices to: receivethe log; and generate the graph from the log.
 25. The set of computingdevices of claim 24, wherein the computer-executable instructions forgenerating the graph comprise computer-executable instructions, which,when executed by the one or more processing units, cause the set ofcomputing devices to: remove at least one attribute, and correspondingvalues, from the log prior to generating the graph.
 26. The set ofcomputing devices of claim 25, wherein the removed at least oneattribute was selected to be removed because a quantity of differentvalues of the removed at least one attribute exceeded a threshold. 27.The set of computing devices of claim 24, wherein thecomputer-executable instructions for generating the graph comprisecomputer-executable instructions, which, when executed by the one ormore processing units, cause the set of computing devices to: identify afirst event within the log; identify, within the log, a second eventthat is conceptually adjacent to the first event given at least onepartitioning attribute that delineates a framework within which loggedevents are evaluated to determine whether or not they are conceptuallyadjacent to one another; generate, as part of the generating the graph,a first node corresponding to the first event, if the first node is notalready part of the graph; generate, as part of the generating thegraph, a second node corresponding to the second event, if the secondnode is not already part of the graph; generate, as part of thegenerating the graph, a first edge from the first node to the secondnode, if the first edge is not already part of the graph; and increment,as part of the generating the graph, a count associated with the firstedge if the first edge is already part of the graph.
 28. The set ofcomputing devices of claim 27, wherein the identification of the secondevent as being conceptually adjacent to the first event is based on asame user participating in the first event and then immediatelysubsequently participating in the second event, the immediatelysubsequently being determined by reference to a time attribute from thelog, the at least one partitioning attribute being a user identifyingattribute by which the same user is distinguished from other users. 29.The set of computing devices of claim 21, wherein a quantity of nodes ofthe trajectory is determined prior to generating the trajectory.
 30. Theset of computing devices of claim 21, wherein the generating thetrajectory ends at a node having no edges departing therefrom even ifthe trajectory does not yet comprise an intended quantity of nodes. 31.A method of artificially creating, from a log, sequences that arerepresentative of events logged in the log, the log comprising, for eachindividual event logged in the log, attribute values associated witheach individual event, the method comprising: randomly selecting aninitial node from a graph whose nodes represent attribute-value pairsfrom the log; and generate a trajectory, that is one of the artificiallycreated sequences, by iteratively adding nodes to the trajectory, eachiteration comprising: treating an immediately previously added node as acurrent node; randomly selecting an edge in accordance with edge valuesassigned to edges proceeding from the current node, the randomlyselected edge connecting the current node to a subsequent node; andadding the subsequent node to the trajectory; wherein edges between thenodes in the graph represent connections between two events logged inthe log, a starting node of an edge representing attribute-value pairsof a first of the two events and an ending node of the edge representingattribute-value pairs of a second of the two events; wherein an edgevalue of the edge represents a quantity of times the attribute-valuepairs of the starting node and the ending node were associated with twoconnected events logged in the log; and wherein the trajectory commencesat the initial node and proceeds through the graph.
 32. The method ofclaim 31, further comprising: generating multiple trajectories; andgenerating a filtered set of trajectories by removing, from thegenerated multiple trajectories, trajectories which, when compared withthe log, occur less than a threshold amount.
 33. The method of claim 32,further comprising: generating output comprising at least some of thefiltered set of trajectories, wherein each output trajectory isassociated with a score based on a quantity of steps in the outputtrajectory and a quantity of occurrences of the output trajectory in thelog.
 34. The method of claim 31, further comprising: receiving the log;and generating the graph from the log.
 35. The method of claim 34,wherein the generating the graph comprises: removing at least oneattribute, and corresponding values, from the log prior to generatingthe graph.
 36. The method of claim 35, wherein the removed at least oneattribute was selected to be removed because a quantity of differentvalues of the removed at least one attribute exceeded a threshold. 37.The method of claim 34, wherein the generating the graph comprises:identifying a first event within the log; identifying, within the log, asecond event that is conceptually adjacent to the first event given atleast one partitioning attribute that delineates a framework withinwhich logged events are evaluated to determine whether or not they areconceptually adjacent to one another; generating, as part of thegenerating the graph, a first node corresponding to the first event, ifthe first node is not already part of the graph; generating, as part ofthe generating the graph, a second node corresponding to the secondevent, if the second node is not already part of the graph; generating,as part of the generating the graph, a first edge from the first node tothe second node, if the first edge is not already part of the graph; andincrementing, as part of the generating the graph, a count associatedwith the first edge if the first edge is already part of the graph. 38.The method of claim 37, wherein the identification of the second eventas being conceptually adjacent to the first event is based on a sameuser participating in the first event and then immediately subsequentlyparticipating in the second event, the immediately subsequently beingdetermined by reference to a time attribute from the log, the at leastone partitioning attribute being a user identifying attribute by whichthe same user is distinguished from other users.
 39. The method of claim31, wherein a quantity of nodes of the trajectory is determined prior togenerating the trajectory.
 40. One or more computer-readable storagemedia comprising computer-executable instructions for artificiallycreating, from a log, sequences that are representative of events loggedin the log, the log comprising, for each individual event logged in thelog, attribute values associated with each individual event, thecomputer-executable instructions, when executed by one or moreprocessing units of a computing device, causing the computing device to:randomly select an initial node from a graph whose nodes representattribute-value pairs from a log of events; and generate a trajectory,that is one of the artificially created sequences, by iteratively addingnodes to the trajectory, each iteration comprising: treating animmediately previously added node as a current node; randomly selectingan edge in accordance with edge values assigned to edges proceeding fromthe current node, the randomly selected edge connecting the current nodeto a subsequent node; and adding the subsequent node to the trajectory;wherein edges between the nodes in the graph represent connectionsbetween two events logged in the log, a starting node of an edgerepresenting attribute-value pairs of a first of the two events and anending node of the edge representing attribute-value pairs of a secondof the two events; wherein an edge value of the edge represents aquantity of times the attribute-value pairs of the starting node and theending node were associated with two connected events logged in the log;and wherein the trajectory commences at the initial node and proceedsthrough the graph.